Modal logics of sabotage revisited

Modal logics of sabotage revisited

Sabotage modal logic was proposed in 2003 as a format for analyzing games that modify the graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has largely come to be viewed as an early dynamic logic of graph change. Our first contribution is a characterization theorem for sabotage modal logic as a fragment of first-order logic...

Fusions of Modal Logics Revisited

The fusion Ll Lr of two normal modal logics formulated in languages with disjoint sets of modal operators is the smallest normal modal logic containing Ll [ Lr. This paper proves that decidability, interpolation, uniform interpolation, and Halld encompleteness are preserved under forming fusions of normal polyadic polymodal logics. Those problems remained open in [Fine & Schurz [3]] and [Kracht...

Expressiveness of Probabilistic Modal Logics, Revisited

Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. Logical characterizations of probabilistic bisimulation and simulation were given by Desharnais et al. These results hold for systems defined on analytic state spaces and assume that there are countably many labels in the case of bisim...

Modal logics of answers

This paper aims to apply modal logics arising from partitionistic structures to the logic of questions and answers. Taking it for granted that a partition of possible worlds serves as a representation of a context, the idea of multi-contextual situation motivates the proposal of partitionistic structures. Logical properties of answers are represented by modal operators on such structures. 1 Mot...

Simulation of Modal Logics with Polymodal Logics